Clustering PROLOG programs for distributed computations
نویسندگان
چکیده
A knowledge base (KB) is a collection of factual information pertaining to the objects of specialized domains or application areas. KB information may be acquired and represented using language paradigms which are based on formalisms of predicate calculus. Usually, the domains are not necessarily distinct due to the interrelatedness of the components of the problem or interdependency of the objects. Therefore, this interdependency could generate long search paths or references to the KB objects, particularly for large KB data. However, KB data can be reorganized into groups or clusters using some common relational information of the data objects. The reorganization process isolates the data into clusters and localizes the interdependency within the clusters. Therefore, the clusters offer opportunities for mapping the data into distributed or parallel processing environments to facilitate computational efficiency. This article focuses on methods for structuring, partitioning, and clustering logic-based KB data (rules and facts) for distributed computations.
منابع مشابه
DISPO: Distributed Multi-Threaded Execution of Prolog Programs
DISPO is a Distributed Prolog Virtual Machine for interpreting and executing Prolog programs through distribution and multi-threading. It is a distributed version of a standard Prolog interpreter designed for exploiting OR-parallelism and pipe-lined AND parallelism. Some distinctive features of DISPO is that it speeds up the execution of Prolog programs and generates all possible solutions for ...
متن کاملLinear tabulated resolution based on Prolog control strategy
Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing t...
متن کاملEngaging Prolog with RDF
Prolog has been often used to represent the axioms and inference over RDF data models often by converting all the data to plain-text Prolog facts and programs. In this paper we present the PRODEF infrastructure for using Prolog for inferencing over RDF data on the Web by representing Prolog programs in RDF, allowing them to be distributed over the Web and even incomplete, and represent reasonin...
متن کاملSubsumption{oriented Push{down Automata ?
This paper presents Subsumption{oriented Push{Down Auto-mata (SPDA), a very general stack formalism used to describe forest (\AND{ OR" tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub{computations. They provide computation sharing and o...
متن کاملOr-Parallel Prolog Execution on Clusters of Multicores
Logic Programming languages, such as Prolog, provide an excellent framework for the parallel execution of logic programs. In particular, the inherent non-determinism in the way logic programs are structured makes Prolog very attractive for the exploitation of implicit parallelism. One of the most noticeable sources of implicit parallelism in Prolog programs is or-parallelism. Or-parallelism ari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Systems and Software
دوره 16 شماره
صفحات -
تاریخ انتشار 1991